Saturated random packing built of arbitrary polygons under random sequential adsorption protocol
نویسندگان
چکیده
منابع مشابه
Random Sequential Adsorption on Random Trees
AIDAN SUDBURY MONASH UNIVERSITY Abstract. When gas molecules bind to a surface they may do so in such a way that the adsorption of one molecule inhibits the arrival of others. Two models which have frequently been studied are the “dimer model” and the “blocking model”, and rather complete solutions for these are known on fixed tree structures or Bethe lattices. In this paper comparisons are mad...
متن کاملRandom and cooperative sequential adsorption
Irreversible random sequential adsorption (RSA) on lattices, and continuum "car parking" analogues, have long received attention as models for reactions on polymer chains, chemisorption on single-crystal surfaces, adsorption in colloidal systems, and solid state transformations. Cooperative generalizations of these models (CSA) are sometimes more appropriate, and can exhibit richer kinetics and...
متن کاملRandom sequential adsorption of trimers and hexamers
Adsorption of trimers and hexamers built of identical spheres was studied numerically using the random sequential adsorption (RSA) algorithm. Particles were adsorbed on a two-dimensional, flat and homogeneous surface. Numerical simulations allowed us to determine the maximal random coverage ratio, RSA kinetics as well as the available surface function (ASF), which is crucial for determining the...
متن کاملTime scale of random sequential adsorption.
A simple multiscale approach to the diffusion-driven adsorption from a solution to a solid surface is presented. The model combines two important features of the adsorption process: (i) The kinetics of the chemical reaction between adsorbing molecules and the surface and (ii) geometrical constraints on the surface made by molecules which are already adsorbed. The process (i) is modeled in a dif...
متن کاملGeneralized Random Sequential Adsorption on Sparse Random Graphs
We investigate Random Sequential Adsorption (RSA) on a random graph via the following greedy algorithm: Order the n vertices at random, and sequentially declare each vertex either active or frozen, depending on some local rule in terms of the state of the neighboring vertices. The classical RSA rule declares a vertex active if none of its neighbors is, in which case the set of active nodes form...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2019
ISSN: 2470-0045,2470-0053
DOI: 10.1103/physreve.100.062901